A Similar Fragments Merging Approach to Learn Automata on Proteins François Coste and Goulven Kerbellec
نویسنده
چکیده
We propose here to learn automata for the characterization of proteins families to overcome the limitations of the position-specific characterizations classically used in Pattern Discovery. We introduce a new heuristic approach learning non-deterministic automata based on selection and ordering of significantly similar fragments to be merged and on physico-chemical properties identification. Quality of the characterization of the major intrinsic protein (MIP) family is assessed by leave-one-out cross-validation for a large range of models specificity. Key-words: grammatical inference, automata, proteins
منابع مشابه
A Similar Fragments Merging Approach to Learn Automata on Proteins
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...
متن کاملLearning Automata on Protein Sequences
Pattern discovery is limited to position-specific characterizations like Prosite’s patterns or profile-HMMs which are unable to handle, for instance, dependencies between amino acids distant in the sequence of a protein, but close in its three-dimensional structure. To overcome these limitations, we propose to learn automata on proteins. Inspired by grammatical inference and multiple alignment ...
متن کاملOptimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملPattern Formation of the FitzHugh-Nagumo Model: Cellular Automata Approach
FitzHugh-Nagumo (FHN) model is a famous Reaction-Diffusion System which first introduced for the conduction of electrical impulses along a nerve fiber. This model is also considered as an abstract model for pattern formation. Here, we have used the Cellular Automata method to simulate the pattern formation of the FHN model. It is shown that the pattern of this model is very similar to those...
متن کاملEfficient Ambiguity Detection in C-NFA, a Step Towards the Inference on Non Deterministic Automata
This work addresses the problem of the inference of non de-terministic automata (NFA) from given positive and negative samples. We propose here to consider this problem as a particular case of the inference of unambiguous nite state classiier. We are then able to present an eecient incompatibility NFA detection framework for state merging inference process.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005